package com.leetcode.LC;

public class LC1295 {
    public int findNumbers(int[] nums) {

        int count = 0;
        for (int num : nums) {
            if (splitNumber(num) % 2 == 0) {
                count++;
            }
        }
        return count;

    }

    public int splitNumber(int n) {
        int num = 0;
        while (n != 0) {
            n /= 10;
            num += 1;
        }
        return num;
    }
}
